Minimum Degree Distance of Five Cyclic Graphs

Let G be a connected graph with n vertices. Then the class of graphs having vertices is denoted by Gn. The subclass 5 cycles are Gn5. classification G∈Gn5 depends on number edges and sum degrees graph. Any in Gn5 contains five linearly independent at least n+3 5-cyclic must equal to twice n+4. In this paper, minimum degree distance cyclic investigated. To find some transformations T have been defined. These transformation applied such way that resultant belongs also T(G) always less than G. For n=5, has 78 six 124. case greater 6, general formula for we proved 3n2+13n-62 using transformations, n≥7.